Bounding the degrees of a minimal μ-basis for a rational surface parametrization

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

investigating the integration of translation technologies into translation programs in iranian universities: basis for a syllabus design in translation technology

today, information technology and computers are indispensable tools of any profession and translation technologies have become an indispensable part of translator’s workstation. with the increasing demands for high productivity and speed as well as consistency and with the rise of new demands for translation and localization, it is necessary for translators to be familiar with market demands an...

1-Generic Degrees Bounding Minimal Degrees Revisited

We show that over the base system P− + Σ2-bounding, the existence of a 1-generic degree < 0′′ bounding a minimal degree is equivalent to Σ2-induction.

متن کامل

A characterization of the 0-basis homogeneous bounding degrees

We say a countable model A has a 0-basis if the types realized in A are uniformly computable. We say A has a (d-)decidable copy if there exists a model B ∼= A such that the elementary diagram of B is (d-)computable. Goncharov, Millar, and Peretyat’kin independently showed there exists a homogeneous model A with a 0-basis but no decidable copy. We extend this result here. Let d ≤ 0′ be any low2 ...

متن کامل

investigating the feasibility of a proposed model for geometric design of deployable arch structures

deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...

On the computational complexity of finding a minimal basis for the guess and determine attack

Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Symbolic Computation

سال: 2019

ISSN: 0747-7171

DOI: 10.1016/j.jsc.2019.02.003